A Derivative PBFT Blockchain Consensus Algorithm With Dual Primary Nodes Based on Separation of Powers-DPNPBFT

نویسندگان

چکیده

The Practical Byzantine Fault Tolerant (PBFT) consensus algorithm has many advantages, which makes PBFT utilized widely. Nonetheless, is not suitable for large-scale node scenarios due to its high communication complexity and it also an apparent disadvantage of inadequate fault tolerance. typically derived algorithms focus on reducing at the cost diminished system security or In this paper, Dual-Primary-Node Tolerance (DPNPBFT) proposed achieve best balance above three performances. First, DPNPBFT selects dual master nodes based idea power separation. two check supervise each other avoid excessive centralization as a single system. It reduces replica node, only communicates with node. Furthermore, we designed architecture get practical 49% tolerance rate, close current mainstream Proof Work Stake algorithms. Experimental results demonstrate that O(N) level excellent anti-host malicious performance. Transactions Per Second stable 1700. proves performance comprehensive Internet Things application scenarios.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Review on Consensus Algorithms in Blockchain

Block chain technology is a decentralized data storage structure based on a chain of data blocks that are related to each other. Block chain saves new blocks in the ledger without trusting intermediaries through a competitive or voting mechanism. Due to the chain structure or the graph between each block with its previous blocks, it is impossible to change blocking data. Block chain architectur...

متن کامل

Solida: A Blockchain Protocol Based on Reconfigurable Byzantine Consensus

The decentralized cryptocurrency Bitcoin has experienced great success but also encountered many challenges. One of the challenges has been the long confirmation time. Another challenge is the lack of incentives at certain steps of the protocol, raising concerns for transaction withholding, selfish mining, etc. To address these challenges, we propose Solida, a decentralized blockchain protocol ...

متن کامل

Blockchain Consensus

In this paper, we present a new definition of Byzantine consensus that applies to blockchains, applications that allow to transfer digital assets through transactions. More precisely, a blockchain is a distributed abstraction where participants must reach a consensus on a unique block of transactions to be appended to the chain. This new consensus definition requires a validity property based o...

متن کامل

Difficulty control for blockchain-based consensus systems

Crypto-currencies like Bitcoin have recently attracted a lot of interest. A crucial ingredient into such systems is the “mining” of a Nakamoto blockchain. We model mining as a Poisson process with time-dependent intensity and use this model to derive predictions about block times for various hash-rate scenarios (exponentially rising hash rate being the most important). We also analyse Bitcoin’s...

متن کامل

An Analysis of Attacks on Blockchain Consensus

We present and validate a novel mathematical model of the blockchain mining process and use it to conduct an economic evaluation of the double-spend attack, which is fundamental to all blockchain systems. Our analysis focuses on the value of transactions that can be secured under a conventional double-spend attack, both with and without a concurrent eclipse attack. We account for an attacker ca...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Access

سال: 2022

ISSN: ['2169-3536']

DOI: https://doi.org/10.1109/access.2022.3192426